Facets of the Linear Ordering Polytope: a unification for the fence family through weighted graphs ⋆
نویسندگان
چکیده
The binary choice polytope appeared in the investigation of the binary choice problem formulated by Guilbaud (1953) and Block and Marschak (1960). It is nowadays known to be the same as the linear ordering polytope from operations research (Grötschel, Jünger and Reinelt, 1985). The central problem is to find facet-defining linear inequalities for the polytope. Fence inequalities constitute a prominent class of such inequalities (Cohen and Falmagne 1978, 1990; Grötschel, Jünger and Reinelt, 1985). Two different generalizations exist for this class: the reinforced fence inequalities (Leung and Lee, 1994; Suck, 1992) and the stability-critical fence inequalities (Koppen, 1995). Together with the fence inequalities, these inequalities form the fence family. Building on previous work on the biorder polytope (Christophe, Doignon and Fiorini, 2004), we provide a new class of inequalities which unifies all inequalities from the fence family. The proof is based on a projection of polytopes. The new class of facet-defining inequalities is related to a specific class of weighted graphs, whose definition relies on a curious extension of the stability number. We investigate this class of weighted graphs which generalize the stability-critical graphs.
منابع مشابه
More facets from fences for linear ordering and acyclic subgraph polytopes
We present new facets for the linear ordering polytope. These new facets generalize facets induced by subgraphs called fences, introduced by Grijtschel et al. (1985) and augmented fences, introduced by McLennan (1990). One novelty of the facets introduced here is that each subgraph induces not one but a family of facets, which are not generally rank inequalities. Indeed, we provide the smallest...
متن کاملWeighted graphs defining facets: A connection between stable set and linear ordering polytopes
A graph is α-critical if its stability number increases whenever an edge is removed from its edge set. The class of α-critical graphs has several nice structural properties, most of them related to their defect which is the number of vertices minus two times the stability number. In particular, a remarkable result of Lovász (1978) is the finite basis theorem for α-critical graphs of a fixed def...
متن کاملOn the Stable Set Polytope of Claw-Free Graphs
In this thesis we focus our attention on the stable set polytope of claw-free graphs. This problem has been open for many years and albeit all the efforts engaged during those last three years, it is still open. This does not mean that no progress has been made and we hope to the contrary that this thesis contains some important advances and that the reader will share this point of view. Unders...
متن کاملThe Characteristic Imset Polytope of Bayesian Networks with Ordered Nodes
In 2010, M. Studený, R. Hemmecke, and S. Lindner explored a new algebraic description of graphical models, called characteristic imsets. Compared with standard imsets, characteristic imsets have several advantages: they are still unique vector representatives of conditional independence structures, 0-1 vectors, and more intuitive in terms of graphs than standard imsets. After defining a charact...
متن کاملOn the relaxation polytope of the linear ordering problem
In the paper we investigate the linear ordering polytope P n. We consider the 3-dicycle relaxation polytope B n and give an example of a fractional vertex of B n such that all non-integral values of the vertex are not equal to 1=2. In this paper also we present a constructive operation (5-Extension) for generating new facets of the linear ordering polytope P n. By connecting MM obius ladders wi...
متن کامل